منابع مشابه
Tinker, tailor, solver, proof
We introduce Tinker, a tool for designing and evaluating proof strategies based on proof-strategy graphs, a formalism introduced by the authors in [7]. We represent proof strategies as open-graphs, which are directed graphs with additional input/output edges. Tactics appear as nodes in a graph, and can be ‘piped’ together by adding edges between them. Goals are added to the input edges of such ...
متن کاملTinker, Tailor, Soldier, Spy*
We examine the distribution and interpretation of post-copular noun phrases in French when they appear with and without an indefinite article (Marie est (une) physicienne). We propose that the alternation is due to the fact that the indefinite article marks saturation of an NP-internal argument slot, and show that because of this, post-copular indefinite NPs are usually but not always existenti...
متن کاملTinker, Tailor: Information Systems and Strategic Development in Knowledge-Based SMEs
Small and Medium Sized Enterprises (SMEs) can experience difficulties in adopting Information Systems (IS) and aligning them with their strategic development. Using the concept of bricolage, an improvisational approach that allows learning from concrete experience, we explore IS adoption and organisational change in two SME case studies. The case studies cover IS rationalisations and innovation...
متن کاملTinker, tailor, software engineer, surgeon: specialization in software systems creation and evolution
This position paper advocates a change of mindset regarding how we perceive of and support those who develop and maintain software systems. We contend that a lack of explicit specialization is impeding our ability to deal effectively with the challenges that arise in the creation and evolution of software systems. Observations from the health sector lead us to reconsider the roles of the profes...
متن کاملA Proof-Producing CSP Solver
PCS is a CSP solver that can produce a machine-checkable deductive proof in case it decides that the input problem is unsatisfiable. The roots of the proof may be nonclausal constraints, whereas the rest of the proof is based on resolution of signed clauses, ending with the empty clause. PCS uses parameterized, constraint-specific inference rules in order to bridge between the nonclausal and th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2014
ISSN: 2075-2180
DOI: 10.4204/eptcs.167.5